A canonical partition relation for finite subsets of ω
نویسندگان
چکیده
منابع مشابه
A canonical partition theorem for trees
We show that for every positive integer d, every downwards closed subtree T of d without terminal nodes and every finite weakly embedded subtree A of T there is a finite list of equivalence relations on Em(T ) with the property that for every other equivalence relation E on Em(T ) there is a strongly embedded subtree S ⊆ T of height ω, such that E Em(S) is equal to one of the equivalence relati...
متن کاملPartition Theorems for Subsets of Vector Spaces
1. INTRODUCTION II [1] two of us iivestigated the problem of determiiiig those cardiials a, /3, y, 8, A for which the followiig statemeet, abbreviated Iá(8, g, a, A, y), holds : "Wheeever V is aa a-dimeesiooal vector space over a field of A elemeets, aad the 8-dimeesiooal subspaces of V are partitiooed iito y classes, there is some /-dimeesiooal subspace of V all of whose 8-dimee-siooal subspac...
متن کاملA relation between infinite subsets and exterior center in groups
Let G be a group. Neumann to answer a question of Paul Erdos proved that every infinite subset of G has two different comuting elements if and only if G is center-by-finite. In this paper, we deal with Erdoschr('39')s question in different aspect and we show that every infinite subset X of G has two different elements x and y such that x^y=1 if and only if the exterior center of G ihas finit...
متن کاملrational subsets of finite groups
we characterize the rational subsets of a finite group and discuss the relations to integral cayley graphs.
متن کاملAn Algorithm for Canonical Forms of Finite Subsets of Zd up to Affinities
In this paper we describe an algorithm for the computation of canonical forms of finite subsets of Z, up to affinities over Z. For fixed dimension d, this algorithm has worst-case asymptotic complexity O(n log n sμ(s)), where n is the number of points in the given subset, s is an upper bound to the size of the binary representation of any of the n points, and μ(s) is an upper bound to the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1976
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90058-3